Extending Oblivious Transfers Efficiently
نویسندگان
چکیده
We consider the problem of extending oblivious transfers: Given a small number of oblivious transfers “for free,” can one implement a large number of oblivious transfers? Beaver has shown how to extend oblivious transfers given a one-way function. However, this protocol is inefficient in practice, in part due to its non-black-box use of the underlying one-way function. We give efficient protocols for extending oblivious transfers in the random oracle model. We also put forward a new cryptographic primitive which can be used to instantiate the random oracle in our constructions. Our methods suggest particularly fast heuristics for oblivious transfer that may be useful in a wide range of applications.
منابع مشابه
Extending Oblivious Transfers Efficiently - How to get Robustness Almost for Free
At Crypto 2003 Ishai et al. gave a protocol which given a small number of (possibly extremely inefficient) oblivious transfers implements an essentially unbounded number of oblivious transfers for an additional overhead, per oblivious transfer, of computing and sending only two hash values. This highly efficient protocol is however only passive secure. To get active security, except with probab...
متن کاملCache-Oblivious Planar Shortest Paths
We present an efficient cache-oblivious implementation of the shortest-path algorithm for planar graphs by Klein et al., and prove that it incurs no more than O ` N B1/2− + N B logN ́ block transfers on a graph with N vertices. This is the first cache-oblivious algorithm for this problem that incurs o(N) block transfers.
متن کاملAn Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters
In many scientific applications it is required to reconstruct a raster dataset many times, each time using a different resolution. This leads to the following problem; let G be a raster of √ N × √ N cells. We want to compute for every integer 2 ≤ μ ≤ √ N a raster Gμ of d √ N/μe × d √ N/μe cells where each cell of Gμ stores the average of the values of μ× μ cells of G. Here we consider the case ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003